Assessment of different reconstruction techniques for implementing the NVSF schemes on unstructured meshes

Three new far‐upwind reconstruction techniques, New‐Technique 1, 2, and 3, are proposed in this paper, which localize the normalized variable and space formulation (NVSF) schemes and facilitate the implementation of standard bounded high‐resolution differencing schemes on arbitrary unstructured meshes. By theoretical analysis, it is concluded that the three new techniques overcome two inherent drawbacks of the original technique found in the literature. Eleven classic high‐resolution NVSF schemes developed in the past decades are selected to evaluate performances of the three new techniques relative to the original technique. Under the circumstances of arbitrary unstructured meshes, stretched meshes, and uniform triangular meshes, for each NVSF scheme, the accuracies and convergence properties, when implementing the four aforementioned far‐upwind reconstruction techniques respectively, are assessed by the pure convection of several scalar profiles. The numerical results clearly show that New‐Technique‐2 leads to a better performance in terms of overall accuracy and convergence behavior for the 11 NVSF schemes. Copyright © 2013 John Wiley & Sons, Ltd.     

A high‐order element based adaptive mesh refinement strategy for three‐dimensional unstructured grid

Adaptive mesh refinement (AMR) shows attractive properties in automatically refining the flow region of interest, and with AMR, better prediction can be obtained with much less labor work and cost compared to manually remeshing or the global mesh refinement. Cartesian AMR is well established; however, AMR on hybrid unstructured mesh, which is heavily used in the high‐Reynolds number flow simulation, is less matured and existing methods may result in degraded mesh quality, which mostly happens in the boundary layer or near the sharp geometric features. User intervention or additional constraints, such as freezing all boundary layer elements or refining the whole boundary layer, are required to assist the refinement process. In this work, a novel AMR strategy is developed to handle existing difficulties. In the new method, high‐order unstructured elements are first generated based on the baseline mesh; then the refinement is conducted in the parametric space; at last, the mesh suitable for the solver is output. Generating refined elements in the parametric space with high‐order elements is the key of this method and this helps to guarantee both the accuracy and robustness. With the current method, 3‐dimensional hybrid unstructured mesh of huge size and complex geometry can be automatically refined, without user intervention nor additional constraints. With test cases including the 2‐dimensional airfoil and 3‐dimensional full aircraft, the current AMR method proves to be accurate, simple, and robust.     

On the accuracy of a nonlinear finite volume method for the solution of diffusion problems using different interpolations strategies

In this paper, we consider a nonlinear finite volume method to solve the steady‐state diffusion equation in nonhomogeneous and non‐isotropic media. The method is nonlinear even if the original problem is linear. In its original form, the scheme is monotone, because the coefficient matrix is monotone under certain assumptions and, as a consequence, whenever the analytic operator demands, it preserves the positivity of numerical solutions. On the other hand, the scheme is unable to reproduce piecewise linear solutions exactly. In order to recover this interesting feature, we use two different interpolation strategies. In this case, even though we are unable to prove monotonicity, we show some numerical evidences that the combined method has an improved behavior, producing second order accurate solutions, even for nonhomogeneous and strongly anisotropic media. Copyright © 2013 John Wiley & Sons, Ltd.     

A class of finite difference schemes for interface problems with an HOC approach

In this paper, we propose a new methodology for numerically solving elliptic and parabolic equations with discontinuous coefficients and singular source terms. This new scheme is obtained by clubbing a recently developed higher‐order compact methodology with special interface treatment for the points just next to the points of discontinuity. The overall order of accuracy of the scheme is at least second. We first formulate the scheme for one‐dimensional (1D) problems, and then extend it directly to two‐dimensional (2D) problems in polar coordinates. In the process, we also perform convergence and related analysis for both the cases. Finally, we show a new direction of implementing the methodology to 2D problems in cartesian coordinates. We then conduct numerous numerical studies on a number of problems, both for 1D and 2D cases, including the flow past circular cylinder governed by the incompressible Navier–Stokes equations. We compare our results with existing numerical and experimental results. In all the cases, our formulation is found to produce better results on coarser grids. For the circular cylinder problem, the scheme used is seen to capture all the flow characteristics including the famous von Kármán vortex street. Copyright © 2016 John Wiley & Sons, Ltd.     

A computational method for geometric optimization of enhanced heat transfer devices based upon entropy generation minimization

A computational fluid dynamics‐based optimization methodology is developed, appropriate for the geometric optimization of enhanced heat transfer devices based upon the principle of entropy generation minimization, in which the objective function is evaluated from a flow field obtained by computational simulation. A quasi‐Newton optimization procedure is employed, with computation of the objective function gradients based upon a finite difference approach. The optimization procedure is developed to be general with regard to the choice of objective function, the details of the problem under consideration, and the computational methodology employed in solving the fluid flow and heat transfer problems. A novel implementation of a Taylor series‐based procedure for the fast solution of nearby problems is presented, which is found to greatly benefit the efficiency of the present methodology. Finally, a numerical experiment is presented, illustrating the use of the present method in the geometric optimization of a practical enhanced heat transfer device on the basis of the criterion of entropy generation minimization. The optimization of the fin spacing of a simple plate fin heat sink is considered, and a comparison of the computational results with results obtained by analytical optimization based upon empirical friction factor and Nusselt number correlations is given. Copyright © 2012 John Wiley & Sons, Ltd.     

Moving grid method for numerical simulation of stratified flows

We develop a second‐order accurate Navier–Stokes solver based on r‐adaptivity of the underlying numerical discretization. The motion of the mesh is based on the fluid velocity field; however, certain adjustments to the Lagrangian velocities are introduced to maintain quality of the mesh. The adjustments are based on the variational approach of energy minimization to redistribute grid points closer to the areas of rapid solution variation. To quantify the numerical diffusion inherent to each method, we monitor changes in the background potential energy, computation of which is based on the density field. We demonstrate on a standing interfacial gravity wave simulation how using our method of grid evolution decreases the rate of increase of the background potential energy compared with using the same advection scheme on the stationary grid. To further highlight the benefit of the proposed moving grid method, we apply it to the nonhydrostatic lock‐exchange flow where the evolution of the interface is more complex than in the standing wave test case. Naive grid evolution based on the fluid velocities in the lock‐exchange flow leads to grid tangling as Kelvin–Helmholtz billows develop at the interface. This is remedied by grid refinement using the variational approach. Copyright © 2012 John Wiley & Sons, Ltd.     

An aspect ratio agglomeration multigrid for unstructured grids

A robust aspect ratio‐based agglomeration algorithm to generate high quality of coarse grids for unstructured and hybrid grids is proposed in this paper. The algorithm focuses on multigrid techniques for the numerical solution of Euler and Navier–Stokes equations, which conform to cell‐centered finite volume special discretization scheme, combines vertex‐based isotropic agglomeration and cell‐based directional agglomeration to yield large increases in convergence rates. Aspect ratio is used as fusing weight to capture the degree of cell convexity and give an indication of cell stretching. Agglomeration front queue is established to propagate inward from the boundaries, which stores isotropic vertex and also high‐stretched cell marked with different flag according to aspect ratio. We conduct the present method to solve Euler and Navier–Stokes equations on unstructured and hybrid grids and compare the results with single grid as well as MGridGen, which shows that the present method is efficient in reducing computational time for large‐scale system equations. Copyright © 2013 John Wiley & Sons, Ltd.     

Numerical analysis of conservative unstructured discretisations for low Mach flows

Unstructured meshes allow easily representing complex geometries and to refine in regions of interest without adding control volumes in unnecessary regions. However, numerical schemes used on unstructured grids have to be properly defined in order to minimise numerical errors. An assessment of a low Mach algorithm for laminar and turbulent flows on unstructured meshes using collocated and staggered formulations is presented. For staggered formulations using cell‐centred velocity reconstructions, the standard first‐order method is shown to be inaccurate in low Mach flows on unstructured grids. A recently proposed least squares procedure for incompressible flows is extended to the low Mach regime and shown to significantly improve the behaviour of the algorithm. Regarding collocated discretisations, the odd–even pressure decoupling is handled through a kinetic energy conserving flux interpolation scheme. This approach is shown to efficiently handle variable‐density flows. Besides, different face interpolations schemes for unstructured meshes are analysed. A kinetic energy‐preserving scheme is applied to the momentum equations, namely, the symmetry‐preserving scheme. Furthermore, a new approach to define the far‐neighbouring nodes of the quadratic upstream interpolation for convective kinematics scheme is presented and analysed. The method is suitable for both structured and unstructured grids, either uniform or not. The proposed algorithm and the spatial schemes are assessed against a function reconstruction, a differentially heated cavity and a turbulent self‐igniting diffusion flame. It is shown that the proposed algorithm accurately represents unsteady variable‐density flows. Furthermore, the quadratic upstream interpolation for convective kinematics scheme shows close to second‐order behaviour on unstructured meshes, and the symmetry‐preserving is reliably used in all computations. Copyright © 2016 John Wiley & Sons, Ltd.     

High‐order ADER‐WENO ALE schemes on unstructured triangular meshes—application of several node solvers to hydrodynamics and magnetohydrodynamics

In this paper, we present a class of high‐order accurate cell‐centered arbitrary Lagrangian–Eulerian (ALE) one‐step ADER weighted essentially non‐oscillatory (WENO) finite volume schemes for the solution of nonlinear hyperbolic conservation laws on two‐dimensional unstructured triangular meshes. High order of accuracy in space is achieved by a WENO reconstruction algorithm, while a local space–time Galerkin predictor allows the schemes to be high order accurate also in time by using an element‐local weak formulation of the governing PDE on moving meshes. The mesh motion can be computed by choosing among three different node solvers, which are for the first time compared with each other in this article: the node velocity may be obtained either (i) as an arithmetic average among the states surrounding the node, as suggested by Cheng and Shu, or (ii) as a solution of multiple one‐dimensional half‐Riemann problems around a vertex, as suggested by Maire, or (iii) by solving approximately a multidimensional Riemann problem around each vertex of the mesh using the genuinely multidimensional Harten–Lax–van Leer Riemann solver recently proposed by Balsara et al. Once the vertex velocity and thus the new node location have been determined by the node solver, the local mesh motion is then constructed by straight edges connecting the vertex positions at the old time level tⁿ with the new ones at the next time level t^{n + 1}. If necessary, a rezoning step can be introduced here to overcome mesh tangling or highly deformed elements. The final ALE finite volume scheme is based directly on a space–time conservation formulation of the governing PDE system, which therefore makes an additional remapping stage unnecessary, as the ALE fluxes already properly take into account the rezoned geometry. In this sense, our scheme falls into the category of direct ALE methods. Furthermore, the geometric conservation law is satisfied by the scheme by construction. We apply the high‐order algorithm presented in this paper to the Euler equations of compressible gas dynamics as well as to the ideal classical and relativistic magnetohydrodynamic equations. We show numerical convergence results up to fifth order of accuracy in space and time together with some classical numerical test problems for each hyperbolic system under consideration. Copyright © 2014 John Wiley & Sons, Ltd.